Efficient exhaustive listings of reversible one dimensional cellular automata

This paper looks at an algebraic formulation of one dimensional cellular automata. Using the formulation, certain properties become apparent and connections to combinatorial structures and graph theory become clear. Strong results about uniqueness and isomorphism allows us to outline eeective algorithms for the generation of exhaustive lists of reversible one dimensional cellular automata, and to count the number of distinct examples that exist.